Local - spin Mutual Exclusion Using Fetch - and - φ Primitives ∗ ( Extended Abstract )

A Generic Local-Spin Fetch-and-φ-based Mutual Exclusion Algorithm∗

We present a generic fetch-and-φ-based local-spin mutual exclusion algorithm, with O(1) time complexityunder the remote-memory-references time measure. This algorithm is “generic” in the sense that it can beimplemented using any fetch-and-φ primitive of rank 2N , where N is the number of processes. The rank ofa fetch-and-φ primitive is a notion introduced herein; informally, it expr...

Local-spin Mutual Exclusion Using Fetch-and- Primitives

We present a generic fetch-and-based local-spin mutual exclusion algorithm, with O(1) time complexity under the remote-memory-references time measure. This algorithm is \generic" in the sense that it can be implemented using any fetch-andprimitive of rank 2N , where N is the number of processes. The rank of a fetch-andprimitive is a notion introduced herein; informally, it expresses the extent ...

Local-spin Mutual Exclusion Using Fetch-and-\phi Primitives

Time Bounds for Mutual Exclusion and Related Problems ( Extended

We establish trade-o s between time complexity and writeand access-contention for solutions to the mutual exclusion problem. The write-contention (accesscontention) of a concurrent program is the number of processes that may be simultaneously enabled to write (access) the same shared variable. Our notion of time complexity distinguishes between local and remote references to shared memory. We s...

Local-spin Algorithms for Variants of Mutual Exclusion Using Read and Write Operations

LOCAL-SPIN ALGORITHMS FOR VARIANTS OF MUTUAL EXCLUSION USING READ AND WRITE OPERATIONS Robert Danek Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2011 Mutual exclusion (ME) is used to coordinate access to shared resources by concurrent processes. We investigate several new N -process shared-memory algorithms for variants of ME, each of which uses only reads ...